Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(X) → cons(X, n__f(g(X)))
g(0) → s(0)
g(s(X)) → s(s(g(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
f(X) → n__f(X)
activate(n__f(X)) → f(X)
activate(X) → X
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(X) → cons(X, n__f(g(X)))
g(0) → s(0)
g(s(X)) → s(s(g(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
f(X) → n__f(X)
activate(n__f(X)) → f(X)
activate(X) → X
Q is empty.
We use [23] with the following order to prove termination.
Lexicographic Path Order [19].
Precedence:
0 > s1
sel2 > activate1 > f1 > cons2 > s1
sel2 > activate1 > f1 > nf1 > s1
sel2 > activate1 > f1 > g1 > s1